The Variable Neighborhood Search for a Consistent Vehicle Routing Problem under the Shift Length Constraints
نویسندگان
چکیده
منابع مشابه
Modified Variable Neighborhood Search for the Vehicle Routing Problem with Accessibility Constraints
The classical capacitated Vehicle Routing Problem (VRP) consists in determining optimal delivery routes for a set of homogeneous vehicles to serve a set of customers. Each route is covered by one vehicle without exceeding its capacity. Moreover, each route starts and ends at the same depot. Each customer is served exactly once. In this paper, we consider the Vehicle Routing Problem with Accessi...
متن کاملA template-based adaptive large neighborhood search for the consistent vehicle routing problem
The consistent vehicle routing problem (ConVRP), as defined in [1], is an extension of the periodic vehicle routing problem. This problem category involves the construction of routes over a given time period, e.g several days, such that customer demands are met. However, a simple delivery is nowadays not enough for companies to differentiate themselves in a competitive environment. For this rea...
متن کاملA Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD) being a combination of the generalized vehicle routing problem, in which the nodes are partitioned into clusters, and the vehicle routing problem with stochastic demands, where the exact demands of the nodes are not known beforehand. It is an NP-hard problem for which we propose a variable neighbor...
متن کاملA Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a proble...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.551